A* search algorithm

Results: 648



#Item
71Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1

Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2010-05-18 03:15:30
72FairCache: Introducing Fairness to ICN Caching 1 University Liang Wang1 of Cambridge, UK

FairCache: Introducing Fairness to ICN Caching 1 University Liang Wang1 of Cambridge, UK

Add to Reading List

Source URL: www.eecs.qmul.ac.uk

Language: English - Date: 2016-07-27 12:13:34
73Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen  Abstract— In this paper we present a design methodology

Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen Abstract— In this paper we present a design methodology

Add to Reading List

Source URL: www.researchgate.net

Language: English
74SpADe: On Shape-based Pattern Detection in Streaming Time Series Yueguo Chen§ Mario A. Nascimento†∗ §

SpADe: On Shape-based Pattern Detection in Streaming Time Series Yueguo Chen§ Mario A. Nascimento†∗ §

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2006-11-21 02:44:25
75A concave regularization technique for sparse mixture models Martin Larsson School of Operations Research and Information Engineering Cornell University

A concave regularization technique for sparse mixture models Martin Larsson School of Operations Research and Information Engineering Cornell University

Add to Reading List

Source URL: papers.nips.cc

Language: English - Date: 2014-02-24 03:30:42
76Order Preserving Matching Jinil Kima , Peter Eadesb , Rudolf Fleischerc,d , Seok-Hee Hongb , Costas S. Iliopoulose,f , Kunsoo Parka,∗, Simon J. Puglisie , Takeshi Tokuyamag a Department  of Computer Science and Enginee

Order Preserving Matching Jinil Kima , Peter Eadesb , Rudolf Fleischerc,d , Seok-Hee Hongb , Costas S. Iliopoulose,f , Kunsoo Parka,∗, Simon J. Puglisie , Takeshi Tokuyamag a Department of Computer Science and Enginee

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-02-18 21:02:47
77Search Algorithms for Biosequences Using Random Projection  Jeremy Buhler A dissertation submitted in partial fulfillment of the requirements for the degree of

Search Algorithms for Biosequences Using Random Projection Jeremy Buhler A dissertation submitted in partial fulfillment of the requirements for the degree of

Add to Reading List

Source URL: www.cse.wustl.edu

Language: English - Date: 2001-08-28 13:13:57
78Landscape Automata for Search Based Procedural Content Generation. Daniel Ashlock and Cameron McGuinness Abstract—This study introduces a new representation landscape automata for encoding heightmaps that may be used f

Landscape Automata for Search Based Procedural Content Generation. Daniel Ashlock and Cameron McGuinness Abstract—This study introduces a new representation landscape automata for encoding heightmaps that may be used f

Add to Reading List

Source URL: eldar.mathstat.uoguelph.ca

Language: English - Date: 2016-07-12 12:05:04
79Towards Optimal Synchronous Counting Christoph Lenzen  Joel Rybicki

Towards Optimal Synchronous Counting Christoph Lenzen Joel Rybicki

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:10
80TOP-K Projection Queries for Probabilistic Business Processes Daniel Deutch Tova Milo  {danielde,milo}@cs.tau.ac.il

TOP-K Projection Queries for Probabilistic Business Processes Daniel Deutch Tova Milo {danielde,milo}@cs.tau.ac.il

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2008-08-14 18:13:40